A Multiple Genome Sequence Matching Based on Skipping Tree
نویسندگان
چکیده
منابع مشابه
Ultra-fast Multiple Genome Sequence Matching Using GPU
In this paper, a contrastive evaluation of massively parallel implementations of suffix tree and suffix array to accelerate genome sequence matching are proposed based on Intel Core i7 3770K quad-core and NVIDIA GeForce GTX680 GPU. Besides suffix array only held approximately 20%∼30% of the space relative to suffix tree, the coalesced binary search and tile optimization make suffix array clearl...
متن کاملHCLBLAST for Genome Sequence Matching
Genome sequence matching is used to reveal biological information hidden in the DNA sequences and genome sequences. The main objective is to find whether the given sequence is like other sequence or not. To find the similarity between the diseases and intensity of the disease DNA sequences are matched. There is large number of sequences and the database is still growing. Given a genome sequence...
متن کاملMultiple Sequence Alignment with a Tree-Based Weighting System
Multiple sequence alignment is a powerful tool for studying structure-function relationship and evolution of biological macromolecules. The problem is computationally hard, and it is impractical to get an exact solution for more than several sequences. Although the so called progressive method is most widely used today for aligning a large set of sequences, the quality of alignments thus obtain...
متن کاملMultiple Sequence Comparison: A Peptide Matching Approach
We present in this paper a peptide matching approach to the multiple comparison of a set of protein sequences. This approach consists in looking for all the words that are common to q of these sequences, where q is a parameter. The comparison between words is done by using as reference an object called a model. In the case of proteins, a model is a product of subsets of the alphabet Σ of the am...
متن کاملA Tree Sequence Alignment-based Tree-to-Tree Translation Model
This paper presents a translation model that is based on tree sequence alignment, where a tree sequence refers to a single sequence of subtrees that covers a phrase. The model leverages on the strengths of both phrase-based and linguistically syntax-based method. It automatically learns aligned tree sequence pairs with mapping probabilities from word-aligned biparsed parallel texts. Compared wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Machine Learning and Computing
سال: 2015
ISSN: 2010-3700
DOI: 10.7763/ijmlc.2015.v5.487